منابع مشابه
Pairwise Independence and Derandomization Pairwise Independence and Derandomization
This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a...
متن کاملPairwise Independence and Derandomization
This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a...
متن کاملDerandomization by Exploiting Redundancy and Mutual Independence
We present schemes for derandomizing parallel algorithms by exploiting redundancy of a shrinking sample space and the mutual independence of random variables. Our design uses n mutually independent random variables built on a sample space with exponential number of points. Our scheme yields an O(log n) time parallel algorithm for the PROFIT/COST problem using no more than linear number of proce...
متن کاملEntropy Versus Pairwise Independence
We give lower bounds on the joint entropy of n pairwise independent random variables. We show that if the variables have no dominant value (their min-entropies are bounded away from zero) then this joint entropy grows as Ω(log n). This rate of growth is known to be best possible. If k-wise independence is assumed, we obtain an optimal Ω(k log n) lower bound for not too large k. We also show tha...
متن کاملSDP Gaps from Pairwise Independence
This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P contains the support of a balanced pairwise independent distribution over the domain of the inputs, then such a problem on n variables cannot be approximated better than the trivial (random) approximation, even after augmenting th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations and Trends® in Theoretical Computer Science
سال: 2005
ISSN: 1551-305X,1551-3068
DOI: 10.1561/0400000009